Uniqueness of Normal Proofs in Implicational Intuitionistic Logic

نویسنده

  • Takahito Aoto
چکیده

A minimal theorem in a logic L is an L-theorem which is not a nontrivial substitution instance of another L-theorem. Komori (1987) raised the question whether every minimal impli-cational theorem in intuitionistic logic has a unique normal proof in the natural deduction system NJ. The answer has been known to be partially positive and generally negative. It is shown here that a minimal implicational theorem A in intuitionistic logic has a unique-normal proof in NJ whenever A is provable without non-prime contraction. The non-prime contraction rule in NJ is the implication introduction rule whose cancelled assumption diiers from a propositional variable and appears more than once in the proof. Our result improves the known partial positive solutions to Komori's problem. Also, we present another simple example of a minimal implicational theorem in intuitionistic logic which does not have a unique-normal proof in NJ.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Studying provability in implicational intuitionistic logic the formula tree approach

We use an alternative graphical representation for formulas in implicational intuitionistic logic in order to obtain and demonstrate results concerning provability. We demonstrate the adequateness of the method in this area, showing that one can easily recognize and prove new results and simplify the proofs of others. As such, we extend a known class of formulas for which uniqueness of -normal ...

متن کامل

Takahito Aoto Hiroakira Ono NON-UNIQUENESS OF NORMAL PROOFS FOR MINIMAL FORMULAS IN IMPLICATION-CONJUNCTION FRAGMENT OF BCK

A minimal formula of a given logic L is a formula which is provable in L and is not a non-trivial substitution instance of other provable formulas in L. In [5], Y. Komori asked whether normal proofs of minimal formulas are unique in the implicational fragments of natural deduction systems for the intuitionistic logic and the logic BCK. It was already shown that the answer is positive for BCK, w...

متن کامل

Proof complexity of intuitionistic implicational formulas

We study implicational formulas in the context of proof complexity of intuitionistic propositional logic (IPC). On the one hand, we give an efficient transformation of tautologies to implicational tautologies that preserves the lengths of intuitionistic extended Frege (EF ) or substitution Frege (SF ) proofs up to a polynomial. On the other hand, EF proofs in the implicational fragment of IPC p...

متن کامل

Unique Normal Proof Property for Implicational Minimal Formulas in the Intuitionistic Logic

A formula is said to have unique-normal proof property and unique-normal proof property ii it has a unique-normal proof and a-normal proof in NJ, respectively. In this report a condition of implicational minimal formulas in the intuitionistic logic for unique-normal proof property is presented making use of unique-normal proof property for negatively non-duplicated formulas. It is shown that th...

متن کامل

The "Relevance" of Intersection and Union Types

The aim of this paper is to investigate a Curry-Howard interpretation of the intersection and union type inference system for Combinatory Logic. Types are interpreted as formulas of a Hilbert-style logic L, which turns out to be an extension of the intuitionistic logic with respect to provable disjunctive formulas (because of new equivalence relations on formulas), while the implicational-conju...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Logic, Language and Information

دوره 8  شماره 

صفحات  -

تاریخ انتشار 1999